# This is a sample Python script.

# Press Shift+F10 to execute it or replace it with your code.
# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.
import logging


def print_hi(name):
    # Use a breakpoint in the code line below to debug your script.
    print(f'Hi, {name}')  # Press Ctrl+F8 to toggle the breakpoint.


# Press the green button in the gutter to run the script.


def initial():
    numbers = [3, 4, 5]
    count = 0
    recursion_operation(numbers, numbers[count], count)

# def recursion_operation(numbers, number, count):
#     for n in range(0 ,number):
#         print("n：", n)
#         if n == number - 1 and count < len(numbers) - 1:
#             print("count：", count)
#             count += 1
#             recursion_operation(numbers, numbers[count], count)


def recursion_operation(circulate, count, parmList=None):
    for i in range(circulate.cycleIndex):
        if count == 0:
            parmList = []
            if count >= 1 and i > 0:
                parmList.remove(parmList[len(parmList) - 1])
            parmList.append(i)
        for c in circulate.caseList:
            k = 0
            for cp in c.caseParamList:
                if cp["isTraversalParam"] == True:
                    cp["putParmValue"] = parmList[k]
                    k += 1
            c.click()

        if circulate.subCirculate != None:
            recursion_operation(circulate.subCirculate, count + 1, parmList)

def maxNumber(m, n):
    t = 0
    if m > n:
        t = m
    else:
        t = n

    t = 2*t
    while True:
        if t % m == 0 and t % n == 0:
            return t

        t += 1



if __name__ == '__main__':
#     print_hi('PyCharm')
#
#     logging.info("{}零售利润计算错误，预期{}，实际{}")
#
#     list = [1,3,4,6,7]
#     hashmaplist = [{"W":1, "1":"d", "D":9}]
#
#     union, partner = 1, 1
#     print(union, partner)
#     # print(*list)
#     #
#     # print(**hashmaplist)
#
#     a = 1 // 3
#     print("a：", a)
# # See PyCharm help at https://www.jetbrains.com/help/pycharm/
#
#
#     l = [0, 3, 6, 7,8]
#     print(l[0:3])

    # numbers = [3, 4, 5]
    # count = 0
    # recursion_operation(numbers, numbers[count], count)

    # msg = {'name': 'wang', 'age': 10}
    #
    # print('my name is {name}, {name} age is {age}'.format(**msg))

    print(maxNumber(27, 36))